We develop eight different mixed-integer convex programming reformulations of 0-1 hyperbolic programs. We obtain analytical results on the relative tightne.
GLOBAL OPTIMIZATION OF 0 − 1 HYPERBOLIC PROGRAMS. 389. The convex and concave ... Saipe, A.L. (1975), Solving a (0, 1) hyperbolic program by branch and bound.
We develop eight different mixed-integer convex programming reformulations of 0-1 hyperbolic programs. We obtain analytical results on the relative ...
We develop eight different mixed-integer convex programming reformulations of 0-1 hyperbolic programs. We obtain analytical results on the relative ...
Related reading · The explicit control law for hybrid systems via parametric programming · Applications of global optimization to process and molecular design.
This paper proposes a new method of solving G-FP problems by a mixed 0–1 linear program to obtain a global optimum. Given a mixed 0–1 polynomial term xy where x ...
Abstract. In this note we study multiple-ratio fractional 0–1 programs, a broad class of NP-hard com- binatorial optimization problems.
People also ask
What is the theory of global optimization?
Oct 30, 2016 · The study of hyperbolic polynomials historically originates in the study of PDEs. I can't speak to the intuition there.
One of the interesting special classes of 0–1 optimization problems is the maximization of the ratio of two linear 0–1 functions: max x ∈ B n f ( x ) = a 0 + ...
Unconstrained hyperbolic 0---1 programming can be solved in linear time when the numerator and the denominator are linear and the latter is always positive.